Geometric vs Network based Spatial Clustering
نویسندگان
چکیده
Geometry based approaches like CrimeStat [7, 3] clusters data based on the geometric location of the points. They exploit a regular geometrical shape like a circle or an ellipse to group high activity areas in domains like crime analysis. CrimeStat uses the K-means [9] and hierarchical nearest neighbour clustering [6] to cluster these activities based on the Euclidean distances between the activities. [3] is a comprehensive report presented to the US National Department of Justice where the authors perform experimental evaluation on London Metropolitan Police Forces Crime Report Information System for Hackney Borough Police for the period June 1999 through August 1999. Since this approach uses an Euclidean distance, it fails to exploit the underlying spatial network.
منابع مشابه
Spatial Analysis in curved spaces with Non-Euclidean Geometry
The ultimate goal of spatial information, both as part of technology and as science, is to answer questions and issues related to space, place, and location. Therefore, geometry is widely used for description, storage, and analysis. Undoubtedly, one of the most essential features of spatial information is geometric features, and one of the most obvious types of analysis is the geometric type an...
متن کاملDegree Correlations in Random Geometric Graphs
Spatially embedded networks are important in several disciplines. The prototypical spatial network we assume is the Random Geometric Graph, of which many properties are known. Here we present new results for the two-point degree correlation function in terms of the clustering coefficient of the graphs for two-dimensional space in particular, with extensions to arbitrary finite dimensions.
متن کاملNew spatial clustering-based models for optimal urban facility location considering geographical obstacles
The problems of facility location and the allocation of demand points to facilities are crucial research issues in spatial data analysis and urban planning. It is very important for an organization or governments to best locate its resources and facilities and efficiently manage resources to ensure that all demand points are covered and all the needs are met. Most of the recent studies, which f...
متن کاملAdvanced Cost based Graph Clustering Algorithm for Random Geometric Graphs
There is an increasing interest in the research of clustering or finding communities in complex networks. Graph clustering and graph partitioning algorithms have been applied to this problem. Several graph clustering methods are come into the field but problem lies in the model espoused by the state-of-the-art graph clustering algorithms for solving real-world situation. In this work, an attemp...
متن کاملPerformance Testing of RNSC and MCL Algorithms on Random Geometric Graphs
The exploration of quality clusters in complex networks is an important issue in many disciplines, which still remains a challenging task. Many graph clustering algorithms came into the field in the recent past but they were not giving satisfactory performance on the basis of robustness, optimality, etc. So, it is most difficult task to decide which one is giving more beneficial clustering resu...
متن کامل